GripNet: Graph information propagation on supergraph for heterogeneous graphs

نویسندگان

چکیده

• A novel supergraph data structure to segregate a heterogeneous graph into interconnected, semantically-coherent subgraphs for efficient learning. new representation learning framework based on graphs and graph-based integration. Extensive experiments seven large-scale datasets link prediction node classification tasks. Heterogeneous aims learn low-dimensional vector representations of different types entities relations empower downstream Existing popular methods either capture semantic relationships but indirectly leverage node/edge attributes in complex way, or directly without taking account. When involving multiple convolution operations, they also have poor scalability. To overcome these limitations, this paper proposes ible Gr aph i nformation p ropagation Net work (GripNet) framework. Specifically, we introduce consisting supervertices superedges. supervertex is subgraph. superedge defines an information propagation path between two supervertices. GripNet learns the interest by propagating along defined using layers. We construct evaluate against competing show its superiority prediction, classification, The code available at https://github.com/nyxflower/GripNet .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining and Indexing Graphs for Supergraph Search

We study supergraph search (SPS), that is, given a query graph q and a graph database G that contains a collection of graphs , return graphs that have q as a supergraph from G. SPS has broad applications in bioinformatics, cheminformatics and other scientific and commercial fields. Determining whether a graph is a subgraph (or supergraph) of another is an NP-complete problem. Hence, it is intra...

متن کامل

Efficient algorithms for supergraph query processing on graph databases

We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a n...

متن کامل

Graph-based Classification on Heterogeneous Information Networks Graph-based Classification on Heterogeneous Information Networks

A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that heterogeneous information networks are prevalent in the real world. Sometimes, label information is available for part of the objects. Learning from such labeled and unlabeled data can lead to good knowledge extraction of the hidden network structure. However, ...

متن کامل

Graph-based Classification on Heterogeneous Information Networks

A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information networks are prevalent in the real world. Sometimes, label information is available for part of the objects. Learning from such labeled and unlabeled data via transductive classification can lead to good knowledge extrac...

متن کامل

Graph Regularized Transductive Classification on Heterogeneous Information Networks

A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information networks are prevalent in the real world. Sometimes, label information is available for some objects. Learning from such labeled and unlabeled data via transductive classification can lead to good knowledge extraction of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2023

ISSN: ['1873-5142', '0031-3203']

DOI: https://doi.org/10.1016/j.patcog.2022.108973